Semi-sparse flow-sensitive pointer analysis
نویسندگان
چکیده
منابع مشابه
Region-Based Selective Flow-Sensitive Pointer Analysis
We introduce a new region-based SELective Flow-Sensitive (Selfs) approach to inter-procedural pointer analysis for C that operates on the regions partitioned from a program. Flow-sensitivity is maintained between the regions but not inside, making traditional flow-insensitive and flow-sensitive as well as recent sparse flow-sensitive analyses all special instances of our Selfs framework. By sep...
متن کاملSPAS: Scalable Path-Sensitive Pointer Analysis on Full-Sparse SSA
We present a new SPAS (ScalablePAth-Sensitive)framework for resolving points-to sets in C programs that exploits recent advances in pointer analysis. SPAS enables intraprocedural path-sensitivity to be obtained in flow-sensitive and context-sensitive (FSCS) techniques scalably, by using BDDs to manipulate program paths and by performing pointer analysis level-by-level on a full-sparse SSA repre...
متن کاملAnalyzing Millions of Lines of Code with Sparse Flow-Sensitive Pointer Analysis
Many program analyses perform better and produce more precise results when they are given precise pointer information. One dimension of precision is flow-sensitive pointer analysis (i.e., an analysis that respects a program’s control-flow), which has been shown to be useful for important applications such as program verification and understanding, among others. However, this type of pointer ana...
متن کاملScalable Flow-Sensitive Pointer Analysis for Java with Strong Updates
The ability to perform strong updates is the main contributor to the precision of flow-sensitive pointer analysis algorithms. Traditional flow-sensitive pointer analyses cannot strongly update pointers residing in the heap. This is a severe restriction for Java programs. In this paper, we propose a new flow-sensitive pointer analysis algorithm for Java that can perform strong updates on heap-ba...
متن کاملField-sensitive pointer analysis for C
The subject of this paper is flowand context-insensitive pointer analysis. We present, for the first time, a fieldsensitive constraint-based analysis for C and evaluate its effects on time and precision. In addition, we study in detail four solving algorithms, including the Heintze-Tardieu solver, over 7 common C programs ranging in size from 5000 to 150,000 lines of code. Our results indicate ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2009
ISSN: 0362-1340,1558-1160
DOI: 10.1145/1594834.1480911